A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
نویسندگان
چکیده
منابع مشابه
Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
We consider a family of N items that are produced in, or obtained from, the same production facility. Demands are deterministic for each item and each period within a given horizon of T periods. If in a given period an order is placed, setup costs are incurred. The aggregate order size is constrained by a capacity limit. The objective is to find a lot-sizing strategy that satisfies the demands ...
متن کاملLagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities
The paper addresses a multi-item, multi-plant lot-sizing problem with transfer costs and capacity constraints. The problem is reformulated according to a multi-commodity flow formalism, and decomposed, through Lagrangean relaxation, into a master facility location problem and a slave minimal cost multi-commodity flow problem. The decomposition framework gives rise in a natural way to the design...
متن کاملProbabilistic Analysis of Multi-Item Capacitated Lot Sizing Problems
This paper conducts a probabilistic analysis of an important class of heuristics for multiitem capacitated lot sizing problems. We characterize the asymptotic performance of so-called progressive interval heuristics as T , the length of the planning horizon, goes to infinity, assuming the data are realizations of a stochastic process of the following type: the vector of cost parameters follows ...
متن کاملGRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a pathrelinking intensification procedure ...
متن کاملStrong Formulations for Multi-item Capacitated Lot Sizing*
Multi-item capacitated lot-sizing problems are reformulated using a class of valid inequalities, which are facets for the single-item uncapacitated problem. Computational results using this reformulation are reported, and problems vnth up to 20 items and 13 periods have been solved to optimality using a commercial mixed integer code. We also show how the valid inequalities can easily be generat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2005
ISSN: 0305-0548
DOI: 10.1016/j.cor.2003.08.002